Decision-Theoretic Logic Programs

نویسندگان

  • Jianzhong Chen
  • Stephen Muggleton
چکیده

We propose a new framework, Decision-theoretic Logic Programs (DTLPs), in the paper. DTLPs extend Probabilistic ILP models by integrating desicion-making features developed in Statistical Decision Theory area. Both decision-theoretic knowledge (eg. utilities) and probabilistic knowledge (eg. probabilities) can be represented and dealt with in DTLPs. An implementation of DTLPs using Stochastic Logic Programs is introduced and a DTLP parameter learning algorithm is discussed accordingly. The representation and methods are tested by performing regression on the traditional mutagenesis dataset.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automata-Theoretic Techniques for Modal Logics of Programs

We present a new technique for obtaining decision procedures for modal logics of programs. The technique centers around a new class of finite automata on infinite trees for which the emptiness problem can be solved in polynomial time. The decision procedures then consist of constructing an automaton A, for a given formulaf, such that A, accepts some tree if and only if f is satisfiable. We illu...

متن کامل

Logic Programming Approach to Automata-Based Decision Procedures

We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog queries. We then show how the use of advanced implementation techniques for Logic Programs, in particular the use of tabling in the XSB system, yields a considerable improvement in performance over more traditional appro...

متن کامل

An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus

The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem ...

متن کامل

RAPPORT Logic Programming and Negation : A Survey

We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the proof-theoretic and model-theoretic issues and the relationships between them.

متن کامل

A syntactic proof of decidability for the logic of bunched implication BI

The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is obtained by freely combining propositional intuitionistic logic and multiplicative intuitionistic linear logic. It possesses an elegant proof theory: its bunched ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009